ÄÚµå¹øÈ£ : |
2 |
|
¹ßÇ¥ÀÚ : |
Çѵ¿¼ö |
|
¼Ò¼Ó : |
KAIST |
|
ºÎ¼ : |
Àü±â¹×ÀüÀÚ°øÇкΠ|
|
Á÷À§ : |
±³¼ö |
|
¼¼¼Ç½Ã°£ : |
09:00~11:00 |
|
¹ßÇ¥ÀÚ¾à·Â : |
2012.12 Carnegie Mellon University (¹Ú»ç)
2004.2 KAIST ÀüÀÚ Àü»êÇаú Á¹¾÷ (Çлç)
2013.1 ~ 2013.5 ¹Ú»çÈÄ ¿¬±¸¿ø Carnegie Mellon University
2013.6 ~ ÇöÀç. KAIST Àü±â ¹× ÀüÀÚ°øÇкΠÁ¶±³¼ö |
|
°¿¬¿ä¾à : |
Middlebox services that inspect packet payloads have become commonplace. Today, anyone can sign up for cloudbased Web application firewall with a single click. These services typically look for known patterns that might appear anywhere in the payload. The key challenge is that existing solutions for pattern matching have become a bottleneck because software packet processing technologies have advanced. The popularization of cloud-based services has made the problem even more critical. This paper presents an efficient multi-pattern string matching algorithm, called DFC. DFC significantly reduces the number of memory accesses and cache misses by using small and cache-friendly data structures and avoids instruction pipeline stalls by minimizing sequential data dependency. Our evaluation shows that DFC improves performance by 2.0 to 3.6 times compared to state-of-the-art on real traffic workload obtained from a commercial network. It also outperforms other algorithms even in the worst case. When applied to middlebox applications, such as network intrusion detection, anti-virus, and Web application firewalls, DFC delivers 57-160% improvement in performance. |
|
|